Shortest path tree

Results: 178



#Item
61Euclidean geometry / Euclidean plane geometry / Simple polygon / Connectivity / Shortest path problem / Tree / Computational geometry / Polyhedra / Art gallery problem / Geometry / Mathematics / Polygons

CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Efficient Visibility Maintenance of a Moving Segment Observer inside a Simple Polygon Amir Ali Khosravi∗†

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2008-10-28 21:27:01
62Routing algorithms / Network theory / Search algorithms / Matching / Shortest path problem / Bellman–Ford algorithm / Shortest path tree / Path / Tree / Graph theory / Mathematics / Theoretical computer science

PDF Document

Add to Reading List

Source URL: web.engr.illinois.edu

Language: English - Date: 2014-12-28 09:03:00
63Graph coloring / Vertex / Graph / Bellman–Ford algorithm / Connected component / Shortest path problem / Tree / Clique / Matching / Graph theory / Graph connectivity / Path

Pregel: A System for Large-Scale Graph Processing Grzegorz Malewicz, Matthew H. Austern, Aart J. C. Bik, James C. Dehnert, Ilan Horn, Naty Leiser, and Grzegorz Czajkowski Google, Inc. {malewicz,austern,ajcbik,dehnert,il

Add to Reading List

Source URL: kowshik.github.io

Language: English - Date: 2011-10-18 16:44:37
64Compiler construction / Search algorithms / Chart parser / Parsing / Bottom-up parsing / Top-down parsing / Tree traversal / Hypergraph / Shortest path problem / Mathematics / Graph theory / Theoretical computer science

PARSING AND HYPERGRAPHS Dan Klein and Christopher D. Manning Computer Science Department Stanford University Stanford, CA

Add to Reading List

Source URL: nlp.stanford.edu

Language: English - Date: 2001-10-09 21:41:35
65Network theory / Graph connectivity / Reachability / R-tree / Routing / Shortest path problem / Pruning / Distributed data storage / Bx-tree / Graph theory / Mathematics / Theoretical computer science

iRoad: A Framework For Scalable Predictive Query Processing On Road Networks ∗ Abdeltawab M. Hendawi

Add to Reading List

Source URL: www-users.cs.umn.edu

Language: English - Date: 2015-04-07 01:41:51
66Algorithm / Mathematical logic / Shortest path problem / Matching / Tree decomposition / Matroid / Combinatorics / Randomized algorithm / Mathematics / Theoretical computer science / Graph theory

24 IP1 ”If You Can Specify It, You Can Analyze It” —The Lasting Legacy of Philippe Flajolet The ”Flajolet School” of the analysis of algorithms and

Add to Reading List

Source URL: www.siam.org

Language: English - Date: 2012-12-18 10:42:32
67NP-complete problems / Network theory / Vertex cover / Steiner tree problem / Shortest path problem / Linear programming / SL / Edge disjoint shortest pair algorithm / Pseudoforest / Theoretical computer science / Graph theory / Mathematics

A Constant-Factor Approximation for Stochastic Steiner Forest ∗ Anupam Gupta Amit Kumar

Add to Reading List

Source URL: www.cse.iitd.ernet.in

Language: English - Date: 2009-03-25 10:41:58
68Search algorithms / Pursuit-evasion / game theory / Shortest path problem / NP-complete / Planar graph / Breadth-first search / Binary tree / Depth-first search / Graph theory / Theoretical computer science / Mathematics

On the complexity of searching for an evader with a faster pursuer Florian Shkurti1 and Gregory Dudek1 Abstract— In this paper we examine pursuit-evasion games in which the pursuer has higher speed than the evader. Thi

Add to Reading List

Source URL: www.cim.mcgill.ca

Language: English - Date: 2013-05-18 17:31:04
69Directed acyclic graph / Shortest path problem / Graph coloring / Planarity testing / Tree / Matroid theory / Path decomposition / Chromatic polynomial / Graph theory / Planar graphs / Network theory

Longest Paths in Planar DAGs in Unambiguous Log-Space

Add to Reading List

Source URL: cjtcs.cs.uchicago.edu

Language: English - Date: 2011-06-02 16:29:35
70Operations research / Spanning tree / Network flow / Minimum spanning tree / Submodular set function / Flow network / Wireless sensor network / Shortest path problem / Graph theory / Mathematics / Theoretical computer science

Near-optimal Sensor Placements: Maximizing Information while Minimizing Communication Cost Andreas Krause Carlos Guestrin

Add to Reading List

Source URL: www.cs.cornell.edu

Language: English - Date: 2006-02-25 23:20:28
UPDATE